package dataMining.VertialTopK2;


/**
 * @author: cuiH
 * Date: 13-7-13
 * 进行相应的连接操作，具体逻辑实现
 * 1-K进行生成操作的过程
 */
public class Connect {
    int connect(int position_1, int position_2) {
        int sup = 0;
        for (int i = 0; i < MyAlgorithm.tranNumber; i++) {
            if (MyAlgorithm.DATA[position_1][i] && MyAlgorithm.DATA[position_2][i]) {
                sup++;
            }
        }
        return sup;
    }
}
